Bidirectional string assembling systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

String Assembling Systems

We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a u...

متن کامل

Approximate String Matching Using a Bidirectional Index

We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [6]. We introduce a formalism, called search schemes, to specify search strategies of this type, then develop a probabilistic measure for the efficiency of a search scheme, prove several combinatorial results on efficient search schemes, and finally, provide experimen...

متن کامل

Assembling Strategies in Extrinsic Evolvable Hardware with Bidirectional Incremental Evolution

Bidirectional incremental evolution (BIE) has been proposed as a technique to overcome the ”stalling” effect in evolvable hardware applications. However preliminary results show perceptible dependence of performance of BIE and quality of evaluated circuit on assembling strategy applied during reverse stage of incremental evolution. The purpose of this paper is to develop assembling strategy tha...

متن کامل

Bidirectional Cooperating Distributed Grammar Systems Bidirectional Cooperating Distributed Grammar Systems

We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules alway...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 2014

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita/2013048